Primitive root finder
Enter $a$:
Enter prime number $p$:
Find first primitive root $g$ modulo $p$ such that $g > a$